منابع مشابه
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
We show how contextual hyperedge replacement grammars can be used to generate abstract meaning representations (AMRs), and argue that they are more suitable for this purpose than hyperedge replacement grammars. Contextual hyperedge replacement turns out to have two advantages over plain hyperedge replacement: it can completely cover the language of all AMRs over a given domain of concepts, and ...
متن کاملHyperedge Replacement, Graph Grammars
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membersh...
متن کاملCooperating Distributed Hyperedge Replacement Grammars
The concept of cooperation and distribution as known from the area of grammar systems is introduced to graph grammars; more precisely, to hyperedge replacement (for short, HR) grammars. This can be seen as a modest approach to controlled HR. Two diierent derivation modes are considered, the so called t-mode and the =k-mode. For the t-mode it is shown that the class of hypergraph languages obtai...
متن کاملContextual Hyperedge Replacement Grammars for the Generation of Abstract Meaning Representations
We attempt to describe the properties of semantic data in the form of graphs by using a graph grammar. In particular, we construct a contextual hyperedge replacement grammar (CHRG) that can generate structurally correct abstract meaning representations (AMRs) over a limited domain of semantic concepts and relations. Moreover, the CHRG can generate minimal AMRs in the sense that none of the piec...
متن کاملHyperedge Replacement and Nonprojective Dependency Structures
Synchronous Hyperedge Replacement Graph Grammars (SHRG) can be used to translate between strings and graphs. In this paper, we study the capacity of these grammars to create non-projective dependency graphs. As an example, we use languages that contain cross serial dependencies. Lexicalized hyperedge replacement grammars can derive string languages (as path graphs) that contain an arbitrary num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2015
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-015-0223-4